Matching with don't-cares and a small number of mismatches
نویسندگان
چکیده
منابع مشابه
Matching with don't-cares and a small number of mismatches
In matching with don’t-cares and k mismatches we are given a pattern of length m and a text of length n, both of which may contain don’t-cares (a symbol that matches all symbols), and the goal is to find all locations in the text that match the pattern with at most k mismatches, where k is a parameter. We present new algorithms that solve this problem using a combination of convolutions and a d...
متن کاملOn pattern matching with k mismatches and few don't cares
We consider the problem of pattern matching with k mismatches, where there can be don't care or wild card characters in the pattern. Specifically, given a pattern P of length m and a text T of length n, we want to find all occurrences of P in T that have no more than k mismatches. The pattern can have don't care characters, which match any character. Without don't cares, the best known algorith...
متن کاملa comparison of teachers and supervisors, with respect to teacher efficacy and reflection
supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...
15 صفحه اولParameterized matching with mismatches
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 . . . tn and pattern p = p1p2 . . . pm over respective alphabets Σt and Σp , the injection πi from Σp to Σt maximizing the number of matches between πi(p) and ti ti+1 . . . ti+m−1 (i = 1,2, . . . , n −m + 1). We examine the special case where both strings are run-length encoded, and further ...
متن کاملFast String Matching with Mismatches
We describe and analyze three simple and fast algorithms on the average for solving the problem of string matching with a bounded number of mismatches. These are the naive algorithm, an algorithm based on the Boyer-Moore approach, and ad-hoc deterministic nite automata searching. We include simulation results that compare these algorithms to previous works.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2009
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2008.10.016